Multiple Tensor Train Approximation of Parametric Constitutive Equations in Elasto-Viscoplasticity
نویسندگان
چکیده
منابع مشابه
Tensor Train Approximation of Moment Equations for the Log-normal Darcy Problem
We study the Darcy problem with log-normal permeability, modeling the fluid flow in a heterogeneous porous medium. A perturbation approach is adopted, expanding the solution in Taylor series around the nominal value of the permeability. The resulting recursive deterministic problem satisfied by the expected value of the stochastic solution, analytically derived and studied in [4], is discretize...
متن کاملDynamical approximation of hierarchical Tucker and tensor-train tensors
We extend results on the dynamical low-rank approximation for the treatment of time-dependent matrices and tensors (Koch & Lubich, 2007 and 2010) to the recently proposed Hierarchical Tucker tensor format (HT, Hackbusch & Kühn, 2009) and the Tensor Train format (TT, Oseledets, 2011), which are closely related to tensor decomposition methods used in quantum physics and chemistry. In this dynamic...
متن کاملDynamical Approximation by Hierarchical Tucker and Tensor-Train Tensors
We extend results on the dynamical low-rank approximation for the treatment of time-dependent matrices and tensors (Koch & Lubich, 2007 and 2010) to the recently proposed Hierarchical Tucker tensor format (HT, Hackbusch & Kühn, 2009) and the Tensor Train format (TT, Oseledets, 2011), which are closely related to tensor decomposition methods used in quantum physics and chemistry. In this dynamic...
متن کاملTensor-Structured Galerkin Approximation of Parametric and Stochastic Elliptic PDEs
We investigate the convergence rate of approximations by finite sums of rank-1 tensors of solutions of multi-parametric elliptic PDEs. Such PDEs arise, for example, in the parametric, deterministic reformulation of elliptic PDEs with random field inputs, based for example, on the M -term truncated Karhunen-Loève expansion. Our approach could be regarded as either a class of compressed approxima...
متن کاملEfficient tensor completion: Low-rank tensor train
This paper proposes a novel formulation of the tensor completion problem to impute missing entries of data represented by tensors. The formulation is introduced in terms of tensor train (TT) rank which can effectively capture global information of tensors thanks to its construction by a wellbalanced matricization scheme. Two algorithms are proposed to solve the corresponding tensor completion p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computational Applications
سال: 2019
ISSN: 2297-8747
DOI: 10.3390/mca24010017